Neural Network Routing for Random Multistage Interconnection Networks

نویسندگان

  • Mark W. Goudreau
  • C. Lee Giles
چکیده

A routing scheme that uses a neural network has been developed that can aid in establishing point-to-point communication routes through multistage interconnection networks (MINs). The neural network is a network of the type that was examined by Hopfield (Hopfield, 1984 and 1985). In this work, the problem of establishing routes through random MINs (RMINs) in a shared-memory, distributed computing system is addressed. The performance of the neural network routing scheme is compared to two more traditional approaches exhaustive search routing and greedy routing. The results suggest that a neural network router may be competitive for certain RMIN s.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

متن کامل

Performance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks

Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...

متن کامل

Routing in All-optical Three Stage-clos Interconnection Networks

Permutation routing is a popular communication pattern in the interconnection networks. Most of the previously proposed routings algorithms on Multistage Interconnection Networks (MINs) work on 2×2 switches. We considered alloptical rearrangeable permutation routing for Clos Interconnection networks. The signal in the optical switch with the same wavelength will cause the crosstalk problem.In t...

متن کامل

Parallel Routing Algorithms in Benes and Clos Networks: A Survey

Benes and Clos networks are an important class of multistage interconnection network due to their expandability and modularity. In this article we present a survey of parallel routing algorithms in Benes and Clos Networks. These parallel routing algorithms are compared in terms of their interconnection topologies, implementation and time complexity. Index Terms : Multistage Interconnection netw...

متن کامل

Empirical evaluation of randomly-wire multistage networks

In this paper, we present experimental data indicating that multistage interconnection networks with randomly positioned wires are likely to be substantially better for message routing applications than traditional multistage networks such as the butterfly. Data is presented for a variety of routing models, including storeand-forward routing, cut-through routing, and circuit switching, as well ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991